0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.12	% Command    : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM
0.12/0.33	% Computer : n007.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1920
0.12/0.33	% WCLimit    : 240
0.12/0.33	% DateTime   : Wed Jul 30 02:11:19 EDT 2025
0.12/0.33	% CPUTime    : 
0.20/0.48	Running higher-order theorem proving
0.20/0.48	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.FN39boWc9o/E---3.1_21725.p
0.20/0.50	# Version: 3.0.0-ho
0.20/0.50	# Preprocessing class: HSSSSMSSSSMNHHA.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.50	# Starting post_as_ho5 with 1200s (5) cores
0.20/0.50	# Starting sh2lt with 240s (1) cores
0.20/0.50	# Starting ehoh_best8_lambda with 240s (1) cores
0.20/0.50	# Starting post_as_ho10 with 240s (1) cores
0.20/0.50	# post_as_ho5 with pid 21803 completed with status 0
0.20/0.50	# Result found by post_as_ho5
0.20/0.50	# Preprocessing class: HSSSSMSSSSMNHHA.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.50	# Starting post_as_ho5 with 1200s (5) cores
0.20/0.50	# SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
0.20/0.50	# Search class: HGUNF-FFSF00-SHHFFMBN
0.20/0.50	# Scheduled 6 strats onto 5 cores with 1200 seconds (1200 total)
0.20/0.50	# Starting ehoh_best6_lambda with 649s (1) cores
0.20/0.50	# Starting post_as_ho5 with 121s (1) cores
0.20/0.50	# Starting ehoh_best_nonlift_nonlambdatoforall with 109s (1) cores
0.20/0.50	# Starting sh2lt with 109s (1) cores
0.20/0.50	# Starting sh2l with 109s (1) cores
0.20/0.50	# ehoh_best_nonlift_nonlambdatoforall with pid 21811 completed with status 0
0.20/0.50	# Result found by ehoh_best_nonlift_nonlambdatoforall
0.20/0.50	# Preprocessing class: HSSSSMSSSSMNHHA.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 240 seconds (1920 total)
0.20/0.50	# Starting post_as_ho5 with 1200s (5) cores
0.20/0.50	# SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true)
0.20/0.50	# Search class: HGUNF-FFSF00-SHHFFMBN
0.20/0.50	# Scheduled 6 strats onto 5 cores with 1200 seconds (1200 total)
0.20/0.50	# Starting ehoh_best6_lambda with 649s (1) cores
0.20/0.50	# Starting post_as_ho5 with 121s (1) cores
0.20/0.50	# Starting ehoh_best_nonlift_nonlambdatoforall with 109s (1) cores
0.20/0.50	# Preprocessing time       : 0.001 s
0.20/0.50	# Presaturation interreduction done
0.20/0.50	
0.20/0.50	# Proof found!
0.20/0.50	# SZS status Theorem
0.20/0.50	# SZS output start CNFRefutation
0.20/0.50	thf(decl_23, type, epred1_1: (($i > $o) > ($i > $o) > $o) > $i > $o).
0.20/0.50	thf(decl_24, type, epred2_1: (($i > $o) > ($i > $o) > $o) > $i > $o).
0.20/0.50	thf(decl_25, type, epred3_1: (($i > $o) > ($i > $o) > $o) > $i > $o).
0.20/0.50	thf(decl_26, type, epred4_1: (($i > $o) > ($i > $o) > $o) > $i > $o).
0.20/0.50	thf(cTHM120B_pme, conjecture, ?[X1:($i > $o) > ($i > $o) > $o]:(((~((X1 @ (^[X2:$i]:(($true))) @ (^[X2:$i]:(~($true)))))&![X3:$i > $o, X4:$i > $o, X5:$i > $o]:((((X1 @ X4 @ X5)&(X1 @ X3 @ X4))=>(X1 @ X3 @ X5))))&![X6:$i > $o]:((X1 @ X6 @ X6)))), file('/export/starexec/sandbox2/tmp/tmp.FN39boWc9o/E---3.1_21725.p', cTHM120B_pme)).
0.20/0.50	thf(c_0_1, negated_conjecture, ~(?[X1:($i > $o) > ($i > $o) > $o]:(((~((X1 @ (^[Z0/* 1 */:$i]:($true)) @ (^[Z0/* 7 */:$i]:(~($true)))))&![X3:$i > $o, X4:$i > $o, X5:$i > $o]:((((X1 @ X4 @ X5)&(X1 @ X3 @ X4))=>(X1 @ X3 @ X5))))&![X6:$i > $o]:((X1 @ X6 @ X6))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM120B_pme])])).
0.20/0.50	thf(c_0_2, negated_conjecture, ![X12:($i > $o) > ($i > $o) > $o]:(((((X12 @ (epred2_1 @ X12) @ (epred3_1 @ X12))|(X12 @ (^[Z0/* 1 */:$i]:($true)) @ (^[Z0/* 7 */:$i]:(~($true))))|~(X12 @ (epred4_1 @ X12) @ (epred4_1 @ X12)))&((X12 @ (epred1_1 @ X12) @ (epred2_1 @ X12))|(X12 @ (^[Z0/* 1 */:$i]:($true)) @ (^[Z0/* 7 */:$i]:(~($true))))|~(X12 @ (epred4_1 @ X12) @ (epred4_1 @ X12))))&(~(X12 @ (epred1_1 @ X12) @ (epred3_1 @ X12))|(X12 @ (^[Z0/* 1 */:$i]:($true)) @ (^[Z0/* 7 */:$i]:(~($true))))|~(X12 @ (epred4_1 @ X12) @ (epred4_1 @ X12))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])).
0.20/0.50	thf(c_0_3, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred1_1 @ X1) @ (epred2_1 @ X1))|(X1 @ (^[Z0/* 3 */:$i]:(($true))) @ (^[Z0/* 7 */:$i]:(~(($true)))))|~((X1 @ (epred4_1 @ X1) @ (epred4_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.50	thf(c_0_4, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (^[Z0/* 3 */:$i]:(($true))) @ (^[Z0/* 7 */:$i]:(~(($true)))))|~((X1 @ (epred1_1 @ X1) @ (epred3_1 @ X1)))|~((X1 @ (epred4_1 @ X1) @ (epred4_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.50	thf(c_0_5, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred1_1 @ X1) @ (epred2_1 @ X1))|(X1 @ (^[Z0/* 3 */:$i]:(($true))) @ (^[Z0/* 4 */:$i]:(~($true))))|~((X1 @ (epred4_1 @ X1) @ (epred4_1 @ X1))))), inference(cn,[status(thm)],[c_0_3])).
0.20/0.50	thf(c_0_6, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (^[Z0/* 3 */:$i]:(($true))) @ (^[Z0/* 4 */:$i]:(~($true))))|~((X1 @ (epred1_1 @ X1) @ (epred3_1 @ X1)))|~((X1 @ (epred4_1 @ X1) @ (epred4_1 @ X1))))), inference(cn,[status(thm)],[c_0_4])).
0.20/0.50	thf(c_0_7, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred2_1 @ X1) @ (epred3_1 @ X1))|(X1 @ (^[Z0/* 3 */:$i]:(($true))) @ (^[Z0/* 7 */:$i]:(~(($true)))))|~((X1 @ (epred4_1 @ X1) @ (epred4_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.50	thf(c_0_8, negated_conjecture, (((epred2_1 @ $eq)=(epred1_1 @ $eq))|((^[Z0/* 4 */:$i]:(~($true)))=(^[Z0/* 3 */:$i]:(($true))))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_5])).
0.20/0.50	thf(c_0_9, negated_conjecture, (((^[Z0/* 4 */:$i]:(~($true)))=(^[Z0/* 3 */:$i]:(($true))))|((epred3_1 @ $eq)!=(epred1_1 @ $eq))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_6])).
0.20/0.50	thf(c_0_10, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred2_1 @ X1) @ (epred3_1 @ X1))|(X1 @ (^[Z0/* 3 */:$i]:(($true))) @ (^[Z0/* 4 */:$i]:(~($true))))|~((X1 @ (epred4_1 @ X1) @ (epred4_1 @ X1))))), inference(cn,[status(thm)],[c_0_7])).
0.20/0.50	thf(c_0_11, negated_conjecture, ((epred2_1 @ $eq)=(epred1_1 @ $eq)), inference(cn,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_8])])).
0.20/0.50	thf(c_0_12, negated_conjecture, ((epred3_1 @ $eq)!=(epred1_1 @ $eq)), inference(cn,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_9])])).
0.20/0.50	thf(c_0_13, negated_conjecture, ((^[Z0/* 4 */:$i]:(~($true)))=(^[Z0/* 3 */:$i]:(($true)))), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_10]), c_0_11]), c_0_12])).
0.20/0.50	thf(c_0_14, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_13])]), ['proof']).
0.20/0.50	# SZS output end CNFRefutation
0.20/0.50	# Parsed axioms                        : 1
0.20/0.50	# Removed by relevancy pruning/SinE    : 0
0.20/0.50	# Initial clauses                      : 3
0.20/0.50	# Removed in clause preprocessing      : 0
0.20/0.50	# Initial clauses in saturation        : 3
0.20/0.50	# Processed clauses                    : 25
0.20/0.50	# ...of these trivial                  : 4
0.20/0.50	# ...subsumed                          : 2
0.20/0.50	# ...remaining for further processing  : 19
0.20/0.50	# Other redundant clauses eliminated   : 0
0.20/0.50	# Clauses deleted for lack of memory   : 0
0.20/0.50	# Backward-subsumed                    : 1
0.20/0.50	# Backward-rewritten                   : 4
0.20/0.50	# Generated clauses                    : 58
0.20/0.50	# ...of the previous two non-redundant : 39
0.20/0.50	# ...aggressively subsumed             : 0
0.20/0.50	# Contextual simplify-reflections      : 0
0.20/0.50	# Paramodulations                      : 3
0.20/0.50	# Factorizations                       : 0
0.20/0.50	# NegExts                              : 2
0.20/0.50	# Equation resolutions                 : 0
0.20/0.50	# Disequality decompositions           : 0
0.20/0.50	# Total rewrite steps                  : 9
0.20/0.50	# ...of those cached                   : 7
0.20/0.50	# Propositional unsat checks           : 0
0.20/0.50	#    Propositional check models        : 0
0.20/0.50	#    Propositional check unsatisfiable : 0
0.20/0.50	#    Propositional clauses             : 0
0.20/0.50	#    Propositional clauses after purity: 0
0.20/0.50	#    Propositional unsat core size     : 0
0.20/0.50	#    Propositional preprocessing time  : 0.000
0.20/0.50	#    Propositional encoding time       : 0.000
0.20/0.50	#    Propositional solver time         : 0.000
0.20/0.50	#    Success case prop preproc time    : 0.000
0.20/0.50	#    Success case prop encoding time   : 0.000
0.20/0.50	#    Success case prop solver time     : 0.000
0.20/0.50	# Current number of processed clauses  : 8
0.20/0.50	#    Positive orientable unit clauses  : 2
0.20/0.50	#    Positive unorientable unit clauses: 0
0.20/0.50	#    Negative unit clauses             : 1
0.20/0.50	#    Non-unit-clauses                  : 5
0.20/0.50	# Current number of unprocessed clauses: 17
0.20/0.50	# ...number of literals in the above   : 37
0.20/0.50	# Current number of archived formulas  : 0
0.20/0.50	# Current number of archived clauses   : 11
0.20/0.50	# Clause-clause subsumption calls (NU) : 4
0.20/0.50	# Rec. Clause-clause subsumption calls : 4
0.20/0.50	# Non-unit clause-clause subsumptions  : 2
0.20/0.50	# Unit Clause-clause subsumption calls : 3
0.20/0.50	# Rewrite failures with RHS unbound    : 0
0.20/0.50	# BW rewrite match attempts            : 3
0.20/0.50	# BW rewrite match successes           : 2
0.20/0.50	# Condensation attempts                : 0
0.20/0.50	# Condensation successes               : 0
0.20/0.50	# Termbank termtop insertions          : 3769
0.20/0.50	# Search garbage collected termcells   : 122
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.004 s
0.20/0.50	# System time              : 0.004 s
0.20/0.50	# Total time               : 0.008 s
0.20/0.50	# Maximum resident set size: 1836 pages
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.017 s
0.20/0.50	# System time              : 0.015 s
0.20/0.50	# Total time               : 0.032 s
0.20/0.50	# Maximum resident set size: 1724 pages
0.20/0.50	% E exiting
0.20/0.50	% E exiting
0.20/0.50	EOF